Quartet-Net: A Quartet-Based Method to Reconstruct Phylogenetic Networks
نویسندگان
چکیده
منابع مشابه
Quartet-net: a quartet-based method to reconstruct phylogenetic networks.
Phylogenetic networks can model reticulate evolutionary events such as hybridization, recombination, and horizontal gene transfer. However, reconstructing such networks is not trivial. Popular character-based methods are computationally inefficient, whereas distance-based methods cannot guarantee reconstruction accuracy because pairwise genetic distances only reflect partial information about a...
متن کاملShort Quartet Puzzling: A New Quartet-Based Phylogeny Reconstruction Algorithm
Quartet-based phylogeny reconstruction methods, such as Quartet Puzzling, were introduced in the hope that they might be competitive with maximum likelihood methods, without being as computationally intensive. However, despite the numerous quartet-based methods that have been developed, their performance in simulation has been disappointing. In particular, Ranwez and Gascuel, the developers of ...
متن کاملThe Short Quartet Method
Reconstructing phylogenetic (evolutionary) trees is a major research problem in biology, but unfortunately the current methods are either inconsistent somewhere in the parameter space (and hence do not reconstruct the tree even given unboundedly long sequences), have poor statistical power (and hence require extremely long sequences on large or highly divergent trees), or have computational req...
متن کاملQuartet consistency count method for reconstructing phylogenetic trees
Among the distance based algorithms in phylogenetic tree reconstruction, the neighbor-joining algorithm has been a widely used and effective method. We propose a new algorithm which counts the number of consistent quartets for cherry picking with tie breaking. We show that the success rate of the new algorithm is almost equal to that of neighbor-joining. This gives an explanation of the qualita...
متن کاملQuartet Compatibility and the Quartet Graph
A collection P of phylogenetic trees is compatible if there exists a single phylogenetic tree that displays each of the trees in P. Despite its computational difficulty, determining the compatibility of P is a fundamental task in evolutionary biology. Characterizations in terms of chordal graphs have been previously given for this problem as well as for the closely-related problems of (i) deter...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Molecular Biology and Evolution
سال: 2013
ISSN: 1537-1719,0737-4038
DOI: 10.1093/molbev/mst040